Genetic algorithm as self-test path and circular self-test path design method
نویسندگان
چکیده
منابع مشابه
Deterministic Circular Self Test Path
CSTP (Circular Self Test Path) is an attractive technique for testing sequential circuits in the nanometer era because it can easily provide at-speed test. But the area overhead of CSTP is high if random-pattern-resistant faults need to be reliably tested. This paper presents a deterministic CSTP (DCSTP) structure that embeds pre-computed test data with predictable area overhead. Experimental r...
متن کاملA retiming-based test pattern generator design for built-in self test of data path architectures
Recently, a new Built-In Self Test (BIST) methodology based on balanced bistable sequential kernels has been proposed that reduces the area overhead and performance degradation associated with the conventional BILBO-oriented BIST methodology. This new methodology guarantees high fault coverage but requires special test sequences and test pattern generator (TPG) designs. In this paper, we demons...
متن کاملMaking the Circular Self-Test Path Technique Effective for Real Circuits
The paper assesses the effectiveness of the Circular Self-Test Path BIST technique from an experimental point of view and proposes an algorithm to overcome the low fault coverage that often arises when real circuits are examined. Several fault simulation experiments have been performed on the ISCAS89 benchmark set, as well as on a set of industrial circuits: in contrast to the theoretical analy...
متن کاملTest session oriented built-in self-testable data path synthesis
Existing high-level BIST synthesis methods focus on one objective, minimizing either area overhead or test time. Hence, those methods do not render exploration of large design space, which may result in a local optimum. In this paper, we present a method which aims to address the problem. Our method tries to find an optimal register assignment for each k-test session. Therefore, it offers a ran...
متن کاملPath-oriented test cases generation based adaptive genetic algorithm
The automatic generation of test cases oriented paths in an effective manner is a challenging problem for structural testing of software. The use of search-based optimization methods, such as genetic algorithms (GAs), has been proposed to handle this problem. This paper proposes an improved adaptive genetic algorithm (IAGA) for test cases generation by maintaining population diversity. It uses ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vietnam Journal of Computer Science
سال: 2018
ISSN: 2196-8888,2196-8896
DOI: 10.1007/s40595-018-0121-0